Iterative Verification Techniques for CTL Model Checking
نویسندگان
چکیده
A paradigm for automatic approximation/refinement in conservative CTL model checking is presented. The approximations are used to verify a given formula conservatively by computing upper and/or lower bounds to the set of satisfying states at each subformula. These approximations attempt to perform conservative verification with the least possible number of BDD variables and BDD nodes. We present new forms of operational graphs to avoid limitations associated with previously used operational graphs. A new techniques for efficient automatic refinement of approximate system is presented. These methods make it easier to find the locality. We also present a new type of don’t cares (Approximate Satisfying Don’t Cares) that can make model checking more efficient in time and space. On average, an order of magnitude speedup was achieved with 89% reduction in memory consumption.
منابع مشابه
Verification of Linear Duration Invariants by Model Checking CTL Properties
Linear duration invariants (LDI) are important safety properties of real-time systems. They can be easily formulated in terms of a class of chop-free formulas in the Duration Calculus (DC). Compared to other temporal logics, the specification in DC is simpler, neater and more importantly easier to understand. However, directly model checking them is more difficult than model checking properties...
متن کاملSymbolic Model-Checking for Real-Time Circuits and Specifications
The verification of real-time properties requires model checking techniques for quantitative temporal structures and real-time temporal logics. However, up to now, most of those problems were solved by a translation into a standard CTL model checking problem with unit-delay structures. Although usual CTL model checkers like SMV can be used then, the translation leads to large structures and CTL...
متن کاملTechniques for Temporal Logic Model Checking
Model checking is a set of formal verification techniques that aim to show that a structure representing a computational system (for instance, a protocol, or a hardware or a software component, among others) is a model for a property that represents a requirement for this system. Many model-checking approaches have been proposed, depending on the formalism the property is expressed in, and the ...
متن کاملIncremental CTL Model Checker for Fair States
CTL (Computation Tree Logic) model checking is a formal method for design verification that checks whether the behavior of the verified system is contained in that of the requirements specification. If this check doesn’t pass, the CTL model checker generates a subset of fair states which belongs to the system but not to the specification. In this letter, we present an incremental method which s...
متن کامل